A Search Algorithm to Find Multiple Sets of One Dimensional Unipolar (Optical) Orthogonal Codes with Same Code-length and Low Weight

— This paper describes a search algorithm to find multiple sets of one dimensional unipolar (optical) orthogonal codes characterized by parameter ac nw. Here binary code sequence of length 'n' ('n' bits) and weight 'w' (number of bit '1's in the sequence) with w << n, as well as a  and c  are auto- from 1 to w-1, multiple sets can be searched out of the codes with auto-correlation constraints less than or equal to given auto-correlation constraint a  using proposed algorithm. The searched multiple sets can be sorted as having number of codes not less than the upper bound of the sets given by Johnson's bound. These one dimensional unipolar orthogonal codes have their application in incoherent optical code division multiple access systems.